On Union-Free and Deterministic Union-Free Languages
نویسندگان
چکیده
The paper continues the study of union-free and deterministic union-free languages. In contrast with the fact that every regular language can be described as a finite union of union-free languages, we show that the finite unions of deterministic union-free languages define a proper subfamily of regular languages. Then we examine the properties of this subfamily.
منابع مشابه
Complexity in Union-Free Regular Languages
We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages accepted by one-cycle-free-path deterministic finite automata, and show that they are properly included in the class of union-free languages. We prove that (deterministic) union-freeness of languages d...
متن کاملMost Complex Deterministic Union-Free Regular Languages
A regular language L is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-freepath finite automaton; this is an automaton which has one final state and exactly one cycle-free path from any state to the final state. Jirásková and Masopust proved that the state complexi...
متن کاملState Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
We investigate the state complexity of multiple unions and of multiple intersections for prefix-free regular languages. Prefix-free deterministic finite automata have their own unique structural properties that are crucial for obtaining state complexity upper bounds that are improved from those for general regular languages. We present a tight lower bound construction for k-union using an alpha...
متن کاملSustainability and Free Education Policy: An Examination of Public Secondary Schools in Ogun State, Nigeria.
The study examined whether education should be free or not among the public secondary school teachers in Ogun State in Nigeria. The study examined the status of the secondary schools in terms of funding available to public secondary schools in Ogun State. The study applied Structural Functionalist theory and adopted qualitative method of data collection. Five (5) Key Informant Interviews (KII) ...
متن کاملMinimal Union-Free Decompositions of Regular Languages
A regular language is called union-free if it can be represented by a regular expression that does not contain the union operation. Every regular language can be decomposed into a union of a finite number of union-free languages (the so-called union-free decomposition). We call the number of components in the minimal union-free decomposition of a regular language the union width of the regular ...
متن کامل